package 剑指Offer._2130;

import general_class.ListNode;

/**
 * @author yzh
 * @version 1.0
 * @date 2021/8/13 9:21
 * 合并两个排序的链表
 * 算法：链表
 */
public class _25 {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode ans = new ListNode();
        ListNode cur = ans;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                cur.next = l1;
                l1 = l1.next;
            } else {
                cur.next = l2;
                l2 = l2.next;
            }
            cur = cur.next;
        }
        if (l1 != null) cur.next = l1;
        if (l2 != null) cur.next = l2;
        return ans.next;
    }

}
